Genetic Algorithms: The Crossover-Mutation Debate
نویسنده
چکیده
Crossover and mutation are two of the most important genetic operators found in genetic algorithms. There has been much debate as to which of these is practically and theoretically more effective. This literature review highlights the principal milestones of this debate. The conclusion we reach is that there is no evidence to show that either operator is better than the other, and that both operators have their own useful qualities. We also highlight some important new trends that we think might influence the debate in the future. This literature review will be particularly useful for those who would like to theoretically study the relative roles of the crossover and mutation operators and for those who practically work with genetic algorithms and would like to learn more about how best to utilize crossover and mutation.
منابع مشابه
Multi-Objective Optimization of Solar Thermal Energy Storage Using Hybrid of Particle Swarm Optimization and Multiple Crossover and Mutation Operator
Increasing of net energy storage (Q net) and discharge time of phase change material (t PCM), simultaneously, are important purpose in the design of solar systems. In the present paper, Multi-Objective (MO) based on hybrid of Particle Swarm Optimization (PSO) and multiple crossover and mutation operator is used for Pareto based optimization of solar systems. The conflicting objectives are Q net...
متن کاملTranslation of the Mutation Operator from Genetic Algorithms to Evolutionary Ontologies
Recently introduced, evolutionary ontologies represent a new concept as a combination of genetic algorithms and ontologies. We have defined a new framework comprising a set of parameters required for any evolutionary algorithm, i.e. ontological space, representation of individuals, the main genetic operators such as selection, crossover, and mutation. Although a secondary operator, mutation pro...
متن کاملA Novel Experimental Analysis of the Minimum Cost Flow Problem
In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...
متن کاملIntelligent scalable image watermarking robust against progressive DWT-based compression using genetic algorithms
Image watermarking refers to the process of embedding an authentication message, called watermark, into the host image to uniquely identify the ownership. In this paper a novel, intelligent, scalable, robust wavelet-based watermarking approach is proposed. The proposed approach employs a genetic algorithm to find nearly optimal positions to insert watermark. The embedding positions coded as chr...
متن کاملOPTIMAL OPERATORS OF GENETIC ALGORITHM IN OPTIMIZING SEGMENTAL PRECAST CONCRETE BRIDGES SUPERSTRUCTURE
Bridges constitute an expensive segment of construction projects; the optimization of their designs will affect their high cost. Segmental precast concrete bridges are one of the most commonly serviced bridges built for mid and long spans. Genetic algorithm is one of the most widely applied meta-heuristic algorithms due to its ability in optimizing cost. Next to providing cost optimization of t...
متن کامل